From fuzzy to annotated semantic web languages

The aim of this chapter is to present a detailed, selfcontained and comprehensive account of the state of the art in representing and reasoning with fuzzy knowledge in Semantic Web Languages such as triple languages RDF/RDFS, conceptual languages of the OWL 2 family and rule languages. We further show how one may generalise them to so-called annotation domains, that cover also e.g. temporal and provenance extensions

The Argumentative Mediator

In this paper we introduce a negotiation mediator in a multiagent context. When negotiation fails, a mediator can interact with the parties, find out about their goals, ontologies, and arguments for and against negotiation outcome, and suggest solutions based on previous experience. An algorithmic schema to be instantiated with particular argumentation, semantic alignment and case-base reasoning techniques is presented. The proposal is neutral with respect to which particular technique is selected. An example illustrates the approach that is framed in the existing body of literature on argumentation and mediation.This research has been supported by Generalitat de Catalunya project 2014 SGR 118.Peer Reviewe

Finding non-compliances with declarative process constraints through semantic technologies

Business process compliance checking enables organisations to assess whether their processes fulfil a given set of constraints, such as regulations, laws, or guidelines. Whilst many process analysts still rely on ad-hoc, often handcrafted per-case checks, a variety of constraint languages and approaches have been developed in recent years to provide automated compliance checking. A salient example is Declare, a well-established declarative process specification language based on temporal logics. Declare specifies the behaviour of processes through temporal rules that constrain the execution of tasks. So far, however, automated compliance checking approaches typically report compliance only at the aggregate level, using binary evaluations of constraints on execution traces. Consequently, their results lack granular information on violations and their context, which hampers auditability of process data for analytic and forensic purposes. To address this challenge, we propose a novel approach that leverages semantic technologies for compliance checking. Our approach proceeds in two stages. First, we translate Declare templates into statements in SHACL, a graph-based constraint language. Then, we evaluate the resulting constraints on the graph-based, semantic representation of process execution logs. We demonstrate the feasibility of our approach by testing its implementation on real-world event logs. Finally, we discuss its implications and future research directions